#include<bits/stdc++.h>
using namespace std;
int rec(int x1, int y1, int x2, int y2) {
return abs(x1 - x2) + abs(y1 - y2);
}
int main() {
int t, n, k;
cin >> t;
for(int i = 1; i <= t; i++){
cin >> n >> k;
vector<pair<int, int>> pos(n);
for (int i = 0; i < n; i++) {
cin >> pos[i].first >> pos[i].second;
}
bool poss = false;
for (int i = 0; i < n; i++) {
bool x = true;
for (int j = 0; j < n; j++) {
if (rec(pos[i].first, pos[i].second, pos[j].first, pos[j].second) > k) {
x = false;
break;
}
}
if (x) {
poss = true;
break;
}
}
if (poss) {
cout << "1\n";
}
else {
cout << "-1\n";
}
}
}
1041D - Glider | 1486A - Shifting Stacks |
1389B - Array Walk | 71B - Progress Bar |
701A - Cards | 545A - Toy Cars |
1538E - Funny Substrings | 234A - Lefthanders and Righthanders |
1611D - Weights Assignment For Tree Edges | 197A - Plate Game |
1474A - Puzzle From the Future | 6B - President's Office |
1405B - Array Cancellation | 431C - k-Tree |
101A - Homework | 1642C - Great Sequence |
1523B - Lord of the Values | 1406C - Link Cut Centroids |
2409. Count Days Spent Together | 2410. Maximum Matching of Players With Trainers |
1604C - Di-visible Confusion | 997A - Convert to Ones |
218A - Mountain Scenery | 486B - OR in Matrix |
1405A - Permutation Forgery | 1733A - Consecutive Sum |
1733B - Rule of League | 1733C - Parity Shuffle Sorting |
1264A - Beautiful Regional Contest | 1695A - Subrectangle Guess |